B_{h}[g] MODULAR SETS FROM B_{h} MODULAR SETS
نویسندگان
چکیده
منابع مشابه
On Modular k-Free Sets
Let n and k be integers. A set A ⊂ Z/nZ is k-free if for all x in A, kx / ∈ A. We determine the maximal cardinality of such a set when k and n are coprime. We also study several particular cases and we propose an efficient algorithm for solving the general case. We finally give the asymptotic behaviour of the minimal size of a k-free set in J1, nK which is maximal for inclusion.
متن کاملSets of Non - Modular Invariant Rings
It is a classical problem to compute a minimal set of invariant polynomials generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case. Apart from very few explicit computations of Gröbner bases, the algorithm only involves very basic operations, and is thus rather fast. As a test bed for com...
متن کاملApplication of Fuzzy-Rough Sets in Modular Neural Networks
In a modular neural network, the conflicting information supplied by the information sources, i.e., the outputs of the subnetworks, can be combined by applying the concept of fuzzy integral. To compute the fuzzy ints gal, it is essential to know the importance of each subset of the information sources in a quantified form. In practice, it is very difficult to determine the worth of the informat...
متن کاملComputing Modular Coincidences for Substitution Tilings and Point Sets
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of Dekking coincidence t...
متن کاملCOORDINATE SUM AND DIFFERENCE SETS OF d-DIMENSIONAL MODULAR HYPERBOLAS
Many problems in additive number theory, such as Fermat’s last theorem and the twin prime conjecture, can be understood by examining sums or differences of a set with itself. A finite set A ⊂ Z is considered sum-dominant if |A+A| > |A−A|. If we consider all subsets of {0, 1, . . . , n−1}, as n → ∞ it is natural to expect that almost all subsets should be difference-dominant, as addition is comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JP Journal of Algebra, Number Theory and Applications
سال: 2015
ISSN: 0972-5555
DOI: 10.17654/jpantaaug2015_001_019